On Weak Markov's Principle

نویسنده

  • Ulrich Kohlenbach
چکیده

We show that the so-called weak Markov’s principle (WMP) which states that every pseudo-positive real number is positive is underivable in T ω :=EHA+AC. Since T ω allows to formalize (at least large parts of) Bishop’s constructive mathematics this makes it unlikely that WMP can be proved within the framework of Bishop-style mathematics (which has been open for about 20 years). The underivability even holds if the ineffective schema of full comprehension (in all types) for negated formulas (in particular for ∃-free formulas) is added which allows to derive the law of excluded middle for such formulas.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Some principles weaker than Markov's principle

We systematically study several principles and give a principle which is weaker than disjunctive Markov’s principle (MP∨). We also show that the principle is underivable and strictly weaker than MP∨ in certain extensions of the system EL of elementary analysis.

متن کامل

A separating hyperplane theorem, the fundamental theorem of asset pricing, and Markov's principle

We prove constructively that every uniformly continuous convex function f : X → R+ has positive infimum, where X is the convex hull of finitely many vectors. Using this result, we prove that a separating hyperplane theorem, the fundamental theorem of asset pricing, and Markov’s principle are constructively equivalent. This is the first time that important theorems are classified into Markov’s p...

متن کامل

Markov's Principle for Propositional Type Theory

In this paper we show how to extend a constructive type theory with a principle that captures the spirit of Markov’s principle from constructive recursive mathematics. Markov’s principle is especially useful for proving termination of specific computations. Allowing a limited form of classical reasoning we get more powerful resulting system which remains constructive and valid in the standard c...

متن کامل

Network Worm Detection using Markov's and Cantelli's Inequalities

© Network Worm Detection using Markov's and Cantelli's Inequalities

متن کامل

Markov's theorem in 3{manifolds

Sofia Lambropoulou and Colin Rourke Abstract In this paper we rst give a one-move version of Markov's braid theorem for knot isotopy in S3 that sharpens the classical theorem. Then a relative version of Markov's theorem concerning a xed braided portion in the knot. We also prove an analogue of Markov's theorem for knot isotopy in knot complements. Finally we extend this last result to prove a M...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Math. Log. Q.

دوره 48  شماره 

صفحات  -

تاریخ انتشار 2002